Chaotic Multiquenching Annealing Applied to the Protein Folding Problem
نویسندگان
چکیده
The Chaotic Multiquenching Annealing algorithm (CMQA) is proposed. CMQA is a new algorithm, which is applied to protein folding problem (PFP). This algorithm is divided into three phases: (i) multiquenching phase (MQP), (ii) annealing phase (AP), and (iii) dynamical equilibrium phase (DEP). MQP enforces several stages of quick quenching processes that include chaotic functions. The chaotic functions can increase the exploration potential of solutions space of PFP. AP phase implements a simulated annealing algorithm (SA) with an exponential cooling function. MQP and AP are delimited by different ranges of temperatures; MQP is applied for a range of temperatures which goes from extremely high values to very high values; AP searches for solutions in a range of temperatures from high values to extremely low values. DEP phase finds the equilibrium in a dynamic way by applying least squares method. CMQA is tested with several instances of PFP.
منابع مشابه
Multiphase Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Protein Folding Problem
A new hybrid Multiphase Simulated Annealing Algorithm using Boltzmann and Bose-Einstein distributions (MPSABBE) is proposed. MPSABBE was designed for solving the Protein Folding Problem (PFP) instances. This new approach has four phases: (i) Multiquenching Phase (MQP), (ii) Boltzmann Annealing Phase (BAP), (iii) Bose-Einstein Annealing Phase (BEAP), and (iv) Dynamical Equilibrium Phase (DEP). B...
متن کاملAnalytically Tuned Simulated Annealing Applied to the Protein Folding Problem
In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient ...
متن کاملEmerging Trends in Soft Computing Models in Bioinformatics and Biomedicine
Soft computing (SC) obtains inexact solutions to computa-tionally hard tasks such as the NP-complete problems, for which there is no known algorithm that can obtain an exact solution in polynomial time. SC differs from conventional hard computing (HC) in that SC is tolerant of imprecision, uncertainty, partial truth, and approximation. Recently, SC has attracted close attention of researchers a...
متن کاملDeterministic Annealing and Chaotic Annealing in a Neural Approach to Quadratic Assignment Problem
In this article, we discuss deterministic annealing and chaotic annealing, when doubly constrained network (DCN) is applied to quadratic assignment problem. The two algorithms are compared in several aspects; they are bifurcation structures, obtained solutions, and parameter determination.
متن کاملPowerful Simulated-Annealing Algorithm Locates Global Minimum of Protein-Folding Potentials from Multiple Starting Conformations
Protein-folding potentials, designed with the explicit goal that the global energy minimum correspond to crystallographically observed conformations of protein molecules, may offer great promise toward calculating native protein structures. Achieving this promise, however, depends on finding an effective means of dealing with the multiple-minimum problem inherent in such potentials. In this stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014